Christopher Lynch And NotÉtats-Unis
List of bibliographic references
Number of relevant bibliographic references: 14.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 002D71 | Siva Anantharaman [France] ; Hai Lin ; Christopher Lynch ; Paliath Narendran ; Michael Rusinowitch [France] | Cap Unification: Application to Protocol Security modulo Homomorphic Encryption |
| 00B015 | Christopher Lynch ; Christelle Scharff | Basic Completion with E-cycle Simplification |
| 00B111 | Christopher Lynch | Local simplification |
| 00B166 | Christopher Lynch ; Polina Strogova | SOUR Graphs for Efficient Completion |
| 00B351 | Christopher Lynch [France] | Local Simplification |
| 00B454 | Christopher Lynch [France] | Local simplification |
| 00B685 | Christopher Lynch [Belgique] ; Christelle Scharff [France] | Basic Completion with E-cycle Simplification |
| 00B962 | Christopher Lynch | Oriented equational logic programming is complete |
| 00BC28 | Christopher Lynch [France] | Oriented Equational Logic Programming is Complete |
| 00BE78 | Claude Kirchner ; Christopher Lynch ; Christelle Scharff | A Fine-grained Concurrent Completion Procedure |
| 00BE89 | Christopher Lynch ; Polina Strogova | PATCH Graphs : An Efficient Data Structure for Completion of Finitely Presented Groups |
| 00C041 | Christopher Lynch [France] ; Polina Strogova [France] | PATCH Graphs: An efficient data structure for completion of finitely presented groups |
| 00C067 | Claude Kirchner [France] ; Christopher Lynch [France] ; Christelle Scharff [France] | Fine-grained concurrent completion |
| 00C165 | Claude Kirchner [France] ; Christopher Lynch ; Christelle Scharff | A Fine-Grained Concurrent Completion Procedure |
| This area was generated with Dilib version V0.6.33. |  |